Automatic assignment of anchoring point correspondence between time-frequency r

نویسندگان

  • Toru Takahashi
  • Masa Toshio Irino
چکیده

The automatic assignment of anchoring points is proposed to define the correspondence between the timefrequency representations of speech samples for speech morphing, speech texture mapping, and so on. The correspondence is modeled as a set of segmental bilinear function. These model parameters are called anchoring points. Although, the correspondence significantly affects the quality of such manipulated speech sounds as morphed and texture mapped speech sounds, anchoring points were manually aligned on time-frequency representations. Anchoring points should be placed at auditorily important locations. When a spectrogram is presented as a timefrequency representation, auditorily important locations are given by formant frequencies around vowel transitions. The central idea of the proposed method is to prepare vowel template spectra with pre-assigned anchoring points in advance and to deform one of the templates to match the input speech spectrum. Finally, anchoring points on the input spectrum are copied from pre-assigned anchoring points. Experimental results suggest that the naturalness of morphed speech based on the proposed automatic assignment method has equivalent quality to STRAIGHT synthetic speech samples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback

A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...

متن کامل

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment

The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T , such that each point in S maps to exactly one point in T , and each point in T maps to at least one point in S. In this paper we show that this problem has an O(n log n)-time solution, provided that the points in S and T are restricted to lie on a line (line...

متن کامل

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem

The restriction scaffold assignment problem takes as input two finite point sets S and T (with S containing more points than T ) and establishes a correspondence between points in S and points in T , such that each point in S maps to exactly one point in T , and each point in T maps to at least one point in S. In this paper we show that this problem has an O(n log n)time solution, provided that...

متن کامل

Investigating the relationship between frequency components of ground reaction force and sport shoe insoles comfort during stance phase of running

Introduction: Shoe insoles are widely recommended to increase sport shoes comfort during running. However, relationship between ground reaction force frequency and perceived comfort is still unclear. The purpose of this study was to evaluate the relationship between ground reaction force frequency changes and perceived comfort during stance phase of running. Methods: 30 female students (mean...

متن کامل

Automatic Mutual Nonrigid Registration of Dense Surface Models by Graphical Model based Inference

Fully automatic nonrigid registration of shapes is highly desired for computer vision and medical image processing. For a nonrigid registration between two shapes ShapeA and ShapeB, the ultimate goal should be to find the correspondence between subparts of the two shapes instead of to achieve a perfect match by applying a forced deformation without constraints on the objects. Such a corresponde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006